Peanuts or paranoia?
نویسندگان
چکیده
منابع مشابه
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfectinformation game trees, and an imperfectinformation game tree search algorithm based on it. The formula and algorithm are general enough to incorporate a wide variety of opponent models. We analyze two opponent models. The “paranoid” model is an information-set analog of the minimax rule used in perfect-information games. The...
متن کاملPeanuts or Pretzels? Changing Attitudes about Eating on Hemodialysis.
I am not that fond of peanuts, and I hate pretzels, but when stuck on an airplane flight, I smile when the flight attendant offers them. This is not because I am hungry, and I certainly do not need the calories. My pleasure is less in the food itself and more in the small ritual of hospitality that marks the midpoint of the flight. Food makes most people feel welcome and appreciated, and patien...
متن کاملModern Narratives of Paranoia
In the fi rst great period of bourgeois hegemony, the reinvention of romance fi nds its strategies in the substitution of new positivities (theology, psychology, the dramatic metaphor) for the older magical content. When at the end of the nineteenth century the search for secular equivalents seems exhausted, the characteristic indirection of a nascent modernism, from Kafka to Cortazar, circumsc...
متن کاملInterpretation biases in paranoia.
Information in the environment is frequently ambiguous in meaning. Emotional ambiguity, such as the stare of a stranger, or the scream of a child, encompasses possible good or bad emotional consequences. Those with elevated vulnerability to affective disorders tend to interpret such material more negatively than those without, a phenomenon known as "negative interpretation bias." In this study ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anaesthesia
سال: 2000
ISSN: 0003-2409
DOI: 10.1046/j.1365-2044.2000.01263.x